Rumor Riding: Peer to Peer Systems

Peer to peer systems are frequently incurred more expense in terms of efficiency transfer and several systems make an effort to cover the uniqueness privacy considerations issues for their users. An anonymity approach mostly existing path base peer before transmits, it has pre-create an anonymous path. An information as well as maintenance transparency of path is a lot high. We proposed mutual anonymity Rumor riding (RR) protocol for decentralization environment peer to peer systems (P2P). The very heavy load path construction carries by RR system using random walk scheme for free initiate peers. We evaluate with before RSA based and also anonymity approach based on AES, RR get extra benefit of lower cryptographic overhead mostly to get anonymity using asymmetric cryptographic algorithm. We illustrate design and effectiveness during the simulations by trace driven. Rumor riding (RR) is very effect and efficient than previous protocols the experimental and analytical result shows us.